例句與用法

1. 3 a new group key management scheme based on a full and balanced tree scheme in conjunction with one-way hash chain is proposed . by comparison, we find that it has good performance of low re-key communication costs and scalable property
   提出一種采用單向哈希鏈結合完全平衡樹的分層密鑰管理方法，比較表明它在密鑰更新時通信次數(shù)較少，是一種高效的密鑰管理方案。
2. these sheme implement the joining of new group members, leaving and moving amount the domain of group member; we adopt the batch rekeying method in individual mss domain to reduce the waste of overlapping rekeying for key path; we divide the cost of t-tree scheme into wireless cost and wired cost, and discuss them operately
   該方案實現(xiàn)了組成員的加入,組成員的離開以及成員的域間移動;對單個mss域內采用批量更新的辦法,減少了重復更新密鑰路徑造成的浪費;將t樹方案的開銷分為有線開銷和無線開銷,分別進行討論。
3. at last, we compare the three sheme including skdc, lkh and m-tree sheme from four aspect : memory cost, encryption cost, decryption cost and transportation cost . we find that : the encryption cost and transportation cost of lkh and m-tree sheme when one group member leaves the group is o ( logn ), but the cost of m-tree scheme is more than lkh scheme; the cost of skdc scheme is o ( n ), so the skdc scheme is not a scalable scheme; the encryption cost and decryption cost when user join and memory cost of m-tree scheme is small than lkh scheme
   最后,從存儲開銷,加密開銷,解密開銷和通信開銷四個方面對skdc,lkh和m樹方案進行了比較,發(fā)現(xiàn)lkh和m樹方案在組成員離開時的加密和傳輸開銷為o(logn),但是m樹方案的開銷略大于lkh方案;而skdc方案的開銷為o(n),因此skdc方案的擴展性很差;在存儲開銷以及成員加入時的加密和解密開銷方面,m樹方案的性能優(yōu)于lkh方案。
4. at last, we compare the three sheme including skdc, lkh and m-tree sheme from four aspect : memory cost, encryption cost, decryption cost and transportation cost . we find that : the encryption cost and transportation cost of lkh and m-tree sheme when one group member leaves the group is o ( logn ), but the cost of m-tree scheme is more than lkh scheme; the cost of skdc scheme is o ( n ), so the skdc scheme is not a scalable scheme; the encryption cost and decryption cost when user join and memory cost of m-tree scheme is small than lkh scheme
   最后,從存儲開銷,加密開銷,解密開銷和通信開銷四個方面對skdc,lkh和m樹方案進行了比較,發(fā)現(xiàn)lkh和m樹方案在組成員離開時的加密和傳輸開銷為o(logn),但是m樹方案的開銷略大于lkh方案;而skdc方案的開銷為o(n),因此skdc方案的擴展性很差;在存儲開銷以及成員加入時的加密和解密開銷方面,m樹方案的性能優(yōu)于lkh方案。
5. we design two different method to build the m-tree called static method and dynamic method separately, and we improve the dynamic initialization process of m-tree scheme by utilizing the dh algorithm . this improvement reduces the encryption cost efficiently in the initialization process . by taking stock of disparity cost between the m-tree and lkh sheme, we found that the encryption cost in joining and leaving operation achieve balance when r = 19
   設計了動態(tài)和靜態(tài)兩種m樹的建立方法,并利用哈希函數(shù)改進了動態(tài)的初始化過程,減少了初始化過程的加密開銷;總結歸納出skdc,lkh和m樹三種方案的性能分析表;通過觀察m樹和lkh方案開銷差隨r的變化,發(fā)現(xiàn)當r=19時,加入和離開操作的加密開銷達到平衡。